Divergence of the sum of the reciprocals of the primes

The sum of the reciprocals of all prime numbers diverges, that is:

$\sum_{p\text{ prime }}\frac1p = \frac12 %2B \frac13 %2B \frac15 %2B \frac17 %2B \frac1{11} %2B \frac1{13} %2B \frac1{17} %2B\cdots = \infty.$

This was proved by Leonhard Euler in 1737, and strengthens Euclid's 3rd-century-BC result that there are infinitely many prime numbers.

There is a variety of proofs of Euler's result, including a lower bound for the partial sums stating that

$\sum_{\scriptstyle p\text{ prime }\atop \scriptstyle p\le n}\frac1p \ge \ln \ln (n%2B1) - \ln\frac{\pi^2}6$

for all natural numbers n. The iterated natural logarithm indicates that the divergence might be very slow, which is indeed the case, see Meissel–Mertens constant.

1 The harmonic series
2 First proof
3 Simpler version of the above proof
4 Second proof
5 Third proof
6 Fourth proof
7 See also
8 References
9 External links

The harmonic series

First, we describe how Euler originally discovered the result. He was considering the harmonic series

$\sum_{n=1}^\infty \frac{1}{n} = 1 %2B \frac{1}{2} %2B \frac{1}{3} %2B \frac{1}{4} %2B \cdots.$

He had already used the following "product formula" to show the existence of infinitely many primes.

$\sum_{n=1}^\infty \frac{1}{n} = \prod_{p} \frac{1}{1-p^{-1}} =\prod_{p} \left( 1%2B\frac{1}{p}%2B\frac{1}{p^2}%2B\cdots \right).$

(Here, the product is taken over all primes p; in the following, a sum or product taken over p always represents a sum or product taken over a specified set of primes, unless noted otherwise.)

Such infinite products are today called Euler products. The product above is a reflection of the fundamental theorem of arithmetic. Of course, the above "equation" is not necessary because the harmonic series is known (by other means) to diverge. This type of formal manipulation was common at the time, when mathematicians were still experimenting with the new tools of calculus.

Euler noted that if there were only a finite number of primes, then the product on the right would clearly converge, contradicting the divergence of the harmonic series. (In modern language, we now say that the existence of infinitely many primes is reflected by the fact that the Riemann zeta function has a simple pole at s = 1.)

First proof

Euler took the above product formula and proceeded to make a sequence of audacious leaps of logic. First, he took the natural logarithm of each side, then he used the Taylor series expansion for ln(1 − x) as well as the sum of a geometric series:

$\begin{align} \ln \left( \sum_{n=1}^\infty \frac{1}{n}\right) & {} = \ln \left( \prod_p \frac{1}{1-p^{-1}}\right) = \sum_p \ln \left( \frac{1}{1-p^{-1}}\right) = \sum_p - \ln(1-p^{-1}) \\ & {} = \sum_p \left( \frac{1}{p} %2B \frac{1}{2p^2} %2B \frac{1}{3p^3} %2B \cdots \right) \\ & {} = \left( \sum_{p}\frac{1}{p} \right) %2B \sum_p \frac{1}{p^2} \left( \frac{1}{2} %2B \frac{1}{3p} %2B \frac{1}{4p^2} %2B \cdots \right) \\ & {} < \left( \sum_p \frac{1}{p} \right) %2B \sum_p \frac{1}{p^2} \left( 1 %2B \frac{1}{p} %2B \frac{1}{p^2} %2B \cdots \right) \\ & {} = \left( \sum_p \frac{1}{p} \right) %2B \left( \sum_p \frac{1}{p(p-1)} \right) \\ & {} = \left( \sum_p \frac{1}{p} \right) %2B C \end{align}$

for a fixed constant C < 1. Since the sum of the reciprocals of the first n positive integers is asymptotic to ln(n), (i.e. their ratio approaches one as n approaches infinity), Euler then concluded

$\frac{1}{2} %2B \frac{1}{3} %2B \frac{1}{5} %2B \frac{1}{7} %2B \frac{1}{11} %2B \cdots = \ln \ln (%2B \infty).$

It is almost certain that Euler meant that the sum of the reciprocals of the primes less than n is asymptotic to ln(ln(n)) as n approaches infinity. It turns out this is indeed the case; Euler had reached a correct result by questionable means.

Simpler version of the above proof

$\begin{align} & {} \quad \ln \left( \sum_{n=1}^\infty \frac{1}{n}\right) = \ln \left( \prod_p \frac{1}{1-p^{-1}}\right) = \sum_p \ln \left( \frac{p}{p-1}\right) = \sum_p \ln\left(1%2B\frac{1}{p-1}\right) \end{align}$

Since

$e^x = 1 %2B x %2B \frac{x^2}{2!} %2B \frac{x^3}{3!} %2B \cdots,$

we get e^x > 1 + x and x > ln(1 + x).

$\sum_p \ln\left(1%2B\frac{1}{p-1}\right) < \sum_p \frac{1}{p - 1}$

Hence $\sum_p \frac{1}{p-1}$ diverges. But 1/(p_i − 1) < 1/p_i−1 where p_i is the i^th prime. Hence $\sum_p \frac{1}{p}$ diverges.

Second proof

The following proof by contradiction is due to Paul Erdős.

Let p_i denote the i^th prime number. Assume that the sum of the reciprocals of the primes converges, i.e.

$\sum_{i=1}^\infty {1\over p_i} < \infty\,.$

Then there exists a positive integer k such that

$\sum_{i=k%2B1}^\infty {1\over p_i} < {1\over 2}.\qquad(1)$

For a positive integer x let M_x denote the set of those n in {1, 2, . . ., x} which are not divisible by any prime greater than p_k. We will now derive an upper and a lower estimate for the number |M_x| of elements in M_x. For large x, these bounds will turn out to be contradictory.

Upper estimate: Every n in M_x can be written as n = r m² with positive integers m and r, where r is square-free. Since only the k primes p₁ . . ., p_k can show up (with exponent 1) in the prime factorization of r, there are at most 2^k different possibilities for r. Furthermore, there are at most √x possible values for m. This gives us the upper estimate

$|M_x| \le 2^k\sqrt{x}\,.\qquad(2)$

Lower estimate: The remaining x − |M_x| numbers in the set difference {1, 2, . . ., x} \ M_x are all divisible by a prime greater than p_k. Let N_i,x denote the set of those n in {1, 2, . . ., x} which are divisible by the i^th prime p_i. Then

$\{1,2,\ldots,x\}\setminus M_x\subset\bigcup_{i=k%2B1}^\infty N_{i,x}\;.$

Since the number of integers in N_i,x is at most x/p_i (actually zero for p_i > x), we get

$x-|M_x| \le \sum_{i=k%2B1}^\infty |N_{i,x}|< \sum_{i=k%2B1}^\infty {x\over p_i}\,.$

Using (1), this implies

${x\over 2} < |M_x|\,.\qquad(3)$

Contradiction: For every integer x ≥ 2^2k + 2, the estimates (2) and (3) cannot hold simultaneously.

Third proof

Here is another proof that actually gives a lower estimate for the partial sums; in particular, it shows that these sums grow at least as fast as ln(ln(n)). The proof is an adaptation of the product expansion idea of Euler. In the following, a sum or product taken over p always represents a sum or product taken over a specified set of primes.

The proof rests upon the following four inequalities:

Every positive integer i can be uniquely expressed as the product of a square-free integer and a square. This gives the inequality

$\sum_{i=1}^n{\frac{1}{i}} \le \prod_{p \le n}{\biggl(1%2B\frac{1}{p}\biggr)}\sum_{k=1}^n{\frac{1}{k^2}}\,,$

where for every i between 1 and n the (expanded) product contains to the square-free part of i and the sum contains to the square part of i (see fundamental theorem of arithmetic).

The upper estimate for the natural logarithm

$\ln(n%2B1) = \int_1^{n%2B1}\frac{dx}x =\sum_{i=1}^n\underbrace{\int_i^{i%2B1}\frac{dx}x}_{{}<1/i} <\sum_{i=1}^n{\frac{1}{i}}.$

The lower estimate 1 + x < exp(x) for the exponential function, which holds for all x > 0.

Let n ≥ 2. The upper bound (using a telescoping sum) for the partial sums (convergence is all we really need)

$\sum_{k=1}^n{\frac{1}{k^2}} < 1%2B\sum_{k=2}^n\underbrace{\biggl(\frac1{k-1/2}-\frac1{k%2B1/2}\biggr)}_{= 1/(k^2-1/4) > 1/k^2}=1%2B\frac23-\frac1{n%2B1/2} < \frac53.$

Combining all these inequalities, we see that

$\ln(n%2B1) < \sum_{i=1}^n\frac{1}{i} \le \prod_{p \le n}{\biggl(1%2B\frac{1}{p}\biggr)}\sum_{k=1}^n{\frac{1}{k^2}} < \frac53\prod_{p \le n}{\exp\biggl(\frac{1}{p}\biggr)} = \frac53\exp\biggl(\sum_{p \le n}{\frac{1}{p}}\biggr).$

Dividing through by 5/3 and taking the natural logarithm of both sides gives

$\ln \ln(n%2B1) - \ln\frac53 < \sum_{p \le n}{\frac{1}{p}}$

as desired. ∎

Using

$\sum_{k=1}^\infty{\frac{1}{k^2}}=\frac{\pi^2}6$

(see Basel problem), the above constant ln (5/3) = 0.51082... can be improved to ln(π²/6) = 0.4977...; in fact it turns out that

$\lim_{n \to \infty } \biggl( \sum_{p \leq n} \frac{1}{p} - \ln(\ln(n)) \biggr)= M,$

where M = 0.261497... is the Meissel–Mertens constant (somewhat analogous to the much more famous Euler–Mascheroni constant).

Fourth proof

From Dusart's inequality (see PNT), we get

$p_n < n \ln n %2B n \ln \ln n \quad\mbox{for } n \ge 6.$

Then

$\sum_{n=1}^\infty \frac1{ p_n} \ge \sum_{n=6}^\infty \frac1{ p_n} \ge \sum_{n=6}^\infty \frac1{ n \ln n %2B n \ln \ln n} \ge \sum_{n=6}^\infty \frac1{2n \ln n} = \infty$

by the integral test for convergence. This shows that the series on the left diverges.

References

William Dunham (1999). Euler The Master of Us All. MAA. pp. 61–79. ISBN 0-88385-328-0.

External links

Chris K. Caldwell: There are infinitely many primes, but, how big of an infinity?